Subdivided graphs have linear ramsey numbers
نویسندگان
چکیده
منابع مشابه
Subdivided graphs have linear ramsey numbers
It is shown that the Ramsey number of any graph with n vertices in which no two vertices of degree at least 3 are adjacent is at most 12n. In particular, the above estimate holds for the Ramsey number of any n-vertex subdivision of an arbitrary graph, provided each edge of the original graph is subdivided at least once. This settles a problem of Burr and Erdös.
متن کاملOn graphs with linear Ramsey numbers
For a ®xed graph H, the Ramsey number r (H ) is de®ned to be the least integer N such that in any 2-coloring of the edges of the complete graph KN, some monochromatic copy of H is always formed. Let H(n, ) denote the class of graphs H having n vertices and maximum degree at most . It was shown by Chvata l, RoÈdl, SzemereÂdi, and Trotter that for each there exists c ( ) such that r (H )< c ( )n...
متن کاملOn Bipartite Graphs with Linear Ramsey Numbers
We provide an elementary proof of the fact that the ramsey number of every bipartite graph H with maximum degree at most ∆ is less than 8(8∆)|V (H)|. This improves an old upper bound on the ramsey number of the n-cube due to Beck, and brings us closer toward the bound conjectured by Burr and Erdős. Applying the probabilistic method we also show that for all ∆≥1 and n≥∆+1 there exists a bipartit...
متن کاملTurán Numbers of Subdivided Graphs
Given a positive integer n and a graph F , the Turán number ex(n, F ) is the maximum number of edges in an n-vertex simple graph that does not contain F as a subgraph. Let H be a graph and p a positive even integer. Let H(p) denote the graph obtained from H by subdividing each of its edges p−1 times. We prove that ex(n,H(p)) = O(n1+(16/p)). This follows from a more general result that we establ...
متن کامل3-Uniform hypergraphs of bounded degree have linear Ramsey numbers
Chvátal, Rödl, Szemerédi and Trotter [1] proved that the Ramsey numbers of graphs of bounded maximum degree are linear in their order. We prove that the same holds for 3-uniform hypergraphs. The main new tool which we prove and use is an embedding lemma for 3-uniform hypergraphs of bounded maximum degree into suitable 3-uniform ‘pseudo-random’ hypergraphs. keywords: hypergraphs; regularity lemm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 1994
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.3190180406